Tootfinder

This https://arxiv.org/abs/2004.01871 has been replaced.
link: https://scholar.google.com/scholar?q=a

Good Basic Invariants and Frobenius Structures
In this paper, we define a set of good basic invariants for a finite complex reflection group under certain conditions. We show that a set of good basic invariants for a finite real reflection group gives a set of the flat invariants obtained by Saito and the Taylor coefficients of these good basic invariants give the structure constants of the multiplication of the Frobenius structure obtained by Dubrovin.

Good Books are Complex Matters: Gauging Complexity Profiles Across Diverse Categories of Perceived Literary Quality
Yuri Bizzoni, Pascale Feldkamp, Ida Marie Lassen, Mia Jacobsen, Mads Rosendahl Thomsen, Kristoffer Nielbo
https://arxiv.org/abs/2404.04022

Good Books are Complex Matters: Gauging Complexity Profiles Across Diverse Categories of Perceived Literary Quality
In this study, we employ a classification approach to show that different categories of literary "quality" display unique linguistic profiles, leveraging a corpus that encompasses titles from the Norton Anthology, Penguin Classics series, and the Open Syllabus project, contrasted against contemporary bestsellers, Nobel prize winners and recipients of prestigious literary awards. Our analysis reveals that canonical and so called high-brow texts exhibit distinct textual features when compared to …

Teaching Higher-Order Logic Using Isabelle
Simon Tobias Lund (Technical University of Denmark), J{\o}rgen Villadsen (Technical University of Denmark)
https://arxiv.org/abs/2404.05458

Teaching Higher-Order Logic Using Isabelle
We present a formalization of higher-order logic in the Isabelle proof assistant, building directly on the foundational framework Isabelle/Pure and developed to be as small and readable as possible. It should therefore serve as a good introduction for someone looking into learning about higher-order logic and proof assistants, without having to study the much more complex Isabelle/HOL with heavier automation. To showcase our development and approach we explain a sample proof, describe the axiom…

This https://arxiv.org/abs/2403.16689 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Synapse: Learning Preferential Concepts from Visual Demonstrations
This paper addresses the problem of preference learning, which aims to learn user-specific preferences (e.g., "good parking spot", "convenient drop-off location") from visual input. Despite its similarity to learning factual concepts (e.g., "red cube"), preference learning is a fundamentally harder problem due to its subjective nature and the paucity of person-specific training data. We address this problem using a new framework called Synapse, which is a neuro-symbolic approach designed to eff…

This https://arxiv.org/abs/2401.14456 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Probing bad theories with the dualization algorithm II
We continue our analysis of bad theories, focusing on quiver theories with bad unitary and special unitary gauge groups in three dimensions. By extending the dualization algorithm we prove that the partition function of bad linear quivers can be written as a distribution, given by a sum of terms involving a product of delta functions times the partition function of a good quiver theory. We describe in detail the good quiver theories appearing in the partition function of the bad theory and disc…

CoqPyt: Proof Navigation in Python in the Era of LLMs
Pedro Carrott, Nuno Saavedra, Kyle Thompson, Sorin Lerner, Jo\~ao F. Ferreira, Emily First
https://arxiv.org/abs/2405.04282 <…

CoqPyt: Proof Navigation in Python in the Era of LLMs
Proof assistants enable users to develop machine-checked proofs regarding software-related properties. Unfortunately, the interactive nature of these proof assistants imposes most of the proof burden on the user, making formal verification a complex, and time-consuming endeavor. Recent automation techniques based on neural methods address this issue, but require good programmatic support for collecting data and interacting with proof assistants. This paper presents CoqPyt, a Python tool for int…

This https://arxiv.org/abs/2311.08283 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
Group testing (GT) is the Boolean version of spare signal recovery and, due to its simplicity, a marketplace for ideas that can be brought to bear upon related problems, such as heavy hitters, compressed sensing, and multiple access channels. The definition of a "good" GT varies from one buyer to another, but it generally includes (i) usage of nonadaptive tests, (ii) limiting to $O(k \log n)$ tests, (iii) resiliency to test noise, (iv) $O(k \mathrm{poly}(\log n))$ decoding time, and (v) lack of…

Enabling Privacy-Preserving Cyber Threat Detection with Federated Learning
Yu Bi, Yekai Li, Xuan Feng, Xianghang Mi
https://arxiv.org/abs/2404.05130 https:…

Enabling Privacy-Preserving Cyber Threat Detection with Federated Learning
Despite achieving good performance and wide adoption, machine learning based security detection models (e.g., malware classifiers) are subject to concept drift and evasive evolution of attackers, which renders up-to-date threat data as a necessity. However, due to enforcement of various privacy protection regulations (e.g., GDPR), it is becoming increasingly challenging or even prohibitive for security vendors to collect individual-relevant and privacy-sensitive threat datasets, e.g., SMS spam/…

Can Small Language Models be Good Reasoners for Sequential Recommendation?
Yuling Wang, Changxin Tian, Binbin Hu, Yanhua Yu, Ziqi Liu, Zhiqiang Zhang, Jun Zhou, Liang Pang, Xiao Wang
https://arxiv.org/abs/2403.04260

Can Small Language Models be Good Reasoners for Sequential Recommendation?
Large language models (LLMs) open up new horizons for sequential recommendations, owing to their remarkable language comprehension and generation capabilities. However, there are still numerous challenges that should be addressed to successfully implement sequential recommendations empowered by LLMs. Firstly, user behavior patterns are often complex, and relying solely on one-step reasoning from LLMs may lead to incorrect or task-irrelevant responses. Secondly, the prohibitively resource requir…

This https://arxiv.org/abs/2403.19598 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Implications of purity constraints on light higgsinos
The lightest supersymmetric particles could be higgsinos that have a small mixing with gauginos. If the lightest higgsino-like state makes up some or all of the dark matter with a thermal freezeout density, then its mass must be between about 100 and 1150 GeV, and dark matter searches put bounds on the amount of gaugino contamination that it can have. Motivated by the generally good agreement of flavor- and CP-violating observables with Standard Model predictions, I consider models in which the…

This https://arxiv.org/abs/2312.15087 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

On the Existence of Seedless Condensers: Exploring the Terrain
We prove several new results for seedless condensers in the context of three related classes of sources: Non-Oblivious Symbol Fixing (NOSF) sources, one-sided NOSF (oNOSF) sources [AORSV, EUROCRYPT'20], and adversarial Chor-Goldreich (aCG) source [DMOZ, STOC'23]. We think of these sources as a sequence of random variables $\mathbf{X}=\mathbf{X}_1,\dots,\mathbf{X}_\ell$ on $\ell$ symbols where at least $g$ out of these $\ell$ symbols are "good" (i.e., have some min-entropy requirement), denoted …

Fast and simple inner-loop algorithms of static / dynamic BLP estimations
Takeshi Fukasawa
https://arxiv.org/abs/2404.04494 https://arxiv.org/pdf/2404.04494
arXiv:2404.04494v1 Announce Type: new
Abstract: This study investigates computationally efficient inner-loop algorithms for estimating static / dynamic BLP models. It provides the following ideas to reduce the number of inner-loop iterations: (1). Add a term concerning the outside option share in the BLP contraction mapping; (2). Analytically represent mean product utilities as a function of value functions and solve for the value functions (for dynamic BLP); (3-1). Combine the spectral / SQUAREM algorithms; (3-2). Choice of the step sizes. These methods are independent and easy to implement. This study shows good performance of these ideas by numerical experiments.

This https://arxiv.org/abs/2004.03587 has been replaced.
link: https://scholar.google.com/scholar?q=a

Good Basic Invariants for Elliptic Weyl Groups and Frobenius Structures
In this paper, we define a set of good basic invariants for the elliptic Weyl group for the elliptic root system. For an elliptic root system of codimension $1$, we show that a set of good basic invariants gives a set of flat invariants obtained by Saito and Taylor coefficients of the good basic invariants give the structure constants of the multiplication of the Frobenius structure obtained by the author.

Mining Potentially Explanatory Patterns via Partial Solutions
GianCarlo Catalano, Alexander E. I. Brownlee, David Cairns, John McCall, Russell Ainslie
https://arxiv.org/abs/2404.04388

Mining Potentially Explanatory Patterns via Partial Solutions
Genetic Algorithms have established their capability for solving many complex optimization problems. Even as good solutions are produced, the user's understanding of a problem is not necessarily improved, which can lead to a lack of confidence in the results. To mitigate this issue, explainability aims to give insight to the user by presenting them with the knowledge obtained by the algorithm. In this paper we introduce Partial Solutions in order to improve the explainability of solutions to co…

Closed-loop Performance Optimization of Model Predictive Control with Robustness Guarantees
Riccardo Zuliani, Efe C. Balta, John Lygeros
https://arxiv.org/abs/2403.04655

Closed-loop Performance Optimization of Model Predictive Control with Robustness Guarantees
Model mismatch and process noise are two frequently occurring phenomena that can drastically affect the performance of model predictive control (MPC) in practical applications. We propose a principled way to tune the cost function and the constraints of linear MPC schemes to achieve good performance and robust constraint satisfaction on uncertain nonlinear dynamics with additive noise. The tuning is performed using a novel MPC tuning algorithm based on backpropagation developed in our earlier w…

VLBI detection of nearby (< 100 pc) young stars: Pilot observations
Sergio A. Dzib, Laurent Loinard, Ralf Launhardt, Jazm\'in Ord\'o\~nez-Toro
https://arxiv.org/abs/2403.04355

VLBI detection of nearby (< 100 pc) young stars: Pilot observations
To increase the number of sources with Very Long Baseline Interferometry (VLBI) astrometry available for comparison with the Gaia results, we have observed 31 young stars with recently reported radio emission. These stars are all in the Gaia DR3 catalog and were suggested, on the basis of conventional interferometry observations, to be non-thermal radio emitters and, therefore, good candidates for VLBI detections. The observations were carried out with the Very Long Baseline Array (VLBA) at two…

On a variant of Hilbert's 16th problem
Armengol Gasull, Paulo Santana
https://arxiv.org/abs/2405.04281 https://arxiv.org/pdf/2405…

On a variant of Hilbert's 16th problem
We study the number of limit cycles that a planar polynomial vector field can have as a function of its number $m$ of monomials. We prove that the number of limit cycles increases at least quadratically with $m$ and we provide good lower bounds for $m\le10.$

This https://arxiv.org/abs/2210.05292 has been replaced.
link: https://scholar.google.com/scholar?q=a

Thurston's asymmetric metrics for Anosov representations
We provide a good dynamical framework allowing to generalize Thurston's asymmetric metric and the associated Finsler norm from Teichmüller space to large classes of Anosov representations. In many cases, including the space of Hitchin representations, this gives a (possibly asymmetric) Finsler distance. In some cases we explicitly compute the associated Finsler norm.

This https://arxiv.org/abs/2308.01154 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

Arithmetic with Language Models: from Memorization to Computation
A better understanding of the emergent computation and problem-solving capabilities of recent large language models is of paramount importance to further improve them and broaden their applicability. This work investigates how a language model, trained to predict the next token, can perform arithmetic computations generalizing beyond training data. Binary addition and multiplication constitute a good testbed for this purpose, since they require a very small vocabulary and exhibit relevant input…

This https://arxiv.org/abs/2211.06818 has been replaced.
link: https://scholar.google.com/scholar?q=a

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
This paper presents a new compressed representation of Boolean functions, called CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams). They are essentially a plug-compatible alternative to BDDs (Binary Decision Diagrams), and hence useful for representing certain classes of functions, matrices, graphs, relations, etc. in a highly compressed fashion. CFLOBDDs share many of the good properties of BDDs, but--in the best case--the CFLOBDD for a Boolean function can be exponentially…

This https://arxiv.org/abs/2404.03580 has been replaced.
initial toot: https://mastoxiv.page/@ar…

The CCube reconstruction algorithm for the SoLid experiment
The SoLid experiment is a very-short-baseline experiment aimed at searching for nuclear reactor-produced active to sterile antineutrino oscillations. The detection principle is based on the pairing of two types of solid scintillators: polyvinyl toluene and $^6$LiF:ZnS(Ag), which is a new technology used in this field of Physics. In addition to good neutron-gamma discrimination, this setup allows the detector to be highly segmented (the basic detection unit is a 5~cm side cube). High segmentatio…

This https://arxiv.org/abs/2404.12656 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Erasure-tolerance scheme for the surface codes on Rydberg atomic quantum computers
Rydberg atom array with optical tweezers is a promising candidate for a fault-tolerant quantum computer, thanks to its good properties such as scalability, long coherence time and optical accessibility for communication. A big barrier to overcome is non-Pauli errors, erasure errors and leakage errors. Conventional work has revealed that leakage error is convertible to erasure error. A remaining problem is that such (converted) erasure errors continuously happen and accumulate. The previous prop…

Early evolution of spin direction in dark matter halos and the effect of the surrounding large-scale tidal field
Pablo L\'opez
https://arxiv.org/abs/2404.04223

Early evolution of spin direction in dark matter halos and the effect of the surrounding large-scale tidal field
It is usually assumed that the angular momentum (AM) of dark matter halos arises during the linear stages of structure formation, as a consequence of the coupling between the proto-haloes' shape and the tidal field produced by their surrounding density perturbations. This approach, known as linear tidal torque theory (TTT), has been shown to make fairly good predictions about the mean evolution of both the AM amplitude and orientation up to approximately the time when the proto-haloes collapse.…

Tables in Leibniz: a challenge for the digital humanities
Ariles Remaki (CNRS, UPCit\'e, SPHERE UMR 7219)
https://arxiv.org/abs/2404.05504 https://

Tables in Leibniz: a challenge for the digital humanities
Leibniz's mathematical texts are a perfect example of a type of historical document that is extremely difficult to deal with in the context of an editorial enterprise: the draft. The tables in Leibniz's mathematical manuscripts are a particularly good example of these difficulties, as they are equivocal sources containing many implicit operations. The publication of these texts raises the question of the nature of these signs and the economy of implicit relationships between their various compo…

The $\bar\partial$-problem on $Z(q)$-domains
Debraj Chakrabarti, Phillip S. Harrington, Andrew Raich
https://arxiv.org/abs/2403.04756 https://

The $\bar\partial$-problem on $Z(q)$-domains
Given a complex manifold containing a relatively compact $Z(q)$ domain, we give sufficient geometric conditions on the domain so that its $L^2$-cohomology in degree $(p,q)$ (known to be finite dimensional) vanishes. The condition consists of the existence of a smooth weight function in a neighborhood of the closure of the domain, where the complex Hessian of the weight has a prescribed number of eigenvalues of a particular sign, along with good interaction at the boundary of the Levi form with …

Wall-modeled large-eddy simulation based on spectral-element discretization
Timofey Mukha, Philipp Schlatter
https://arxiv.org/abs/2404.05378 https://

Wall-modeled large-eddy simulation based on spectral-element discretization
This article analyses the simulation methodology for wall-modeled large-eddy simulations using solvers based on the spectral-element method (SEM). To that end, algebraic wall modeling is implemented in the popular SEM solver Nek5000. It is combined with explicit subgrid-scale (SGS) modeling, which is shown to perform better than the high-frequency filtering traditionally used with the SEM. In particular, the Vreman model exhibits a good balance in terms stabilizing the simulations, yet retainin…

Controllable Prompt Tuning For Balancing Group Distributional Robustness
Hoang Phan, Andrew Gordon Wilson, Qi Lei
https://arxiv.org/abs/2403.02695 https://…

Controllable Prompt Tuning For Balancing Group Distributional Robustness
Models trained on data composed of different groups or domains can suffer from severe performance degradation under distribution shifts. While recent methods have largely focused on optimizing the worst-group objective, this often comes at the expense of good performance on other groups. To address this problem, we introduce an optimization scheme to achieve good performance across groups and find a good solution for all without severely sacrificing performance on any of them. However, directly…

POMDP-Guided Active Force-Based Search for Robotic Insertion
Chen Wang, Haoxiang Luo, Kun Zhang, Hua Chen, Jia Pan, Wei Zhang
https://arxiv.org/abs/2404.03943

POMDP-Guided Active Force-Based Search for Robotic Insertion
In robotic insertion tasks where the uncertainty exceeds the allowable tolerance, a good search strategy is essential for successful insertion and significantly influences efficiency. The commonly used blind search method is time-consuming and does not exploit the rich contact information. In this paper, we propose a novel search strategy that actively utilizes the information contained in the contact configuration and shows high efficiency. In particular, we formulate this problem as a Partial…

This https://arxiv.org/abs/2312.08392 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Supporting traversable wormholes: the case for noncommutative geometry
While wormholes may be just as good a prediction of Einstein's theory as black holes, they are subject to severe restrictions from quantum field theory. In particular, a wormhole can only be held open by violating the null energy condition, calling for the existence of "exotic matter," a condition that many researchers consider completely unphysical, enough to rule out macroscopic traversable wormholes. An equally serious problem is the enormous radial tension at the throat of a typical Morris-…

In-Flight Estimation of Instrument Spectral Response Functions Using Sparse Representations
Jihanne El Haouari, Jean-Michel Gaucel, Christelle Pittet, Jean-Yves Tourneret, Herwig Wendt
https://arxiv.org/abs/2404.05298

In-Flight Estimation of Instrument Spectral Response Functions Using Sparse Representations
Accurate estimates of Instrument Spectral Response Functions (ISRFs) are crucial in order to have a good characterization of high resolution spectrometers. Spectrometers are composed of different optical elements that can induce errors in the measurements and therefore need to be modeled as accurately as possible. Parametric models are currently used to estimate these response functions. However, these models cannot always take into account the diversity of ISRF shapes that are encountered in p…

This https://arxiv.org/abs/2308.05853 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Quotient Quiver Subtraction
We develop the diagrammatic technique of quiver subtraction to facilitate the identification and evaluation of the $\mathrm{SU}(n)$ hyper-Kähler quotient (HKQ) of the Coulomb branch of a $3d$ $\mathcal{N}=4$ unitary quiver theory. The target quivers are drawn from a wide range of theories, typically classified as ''good'' or ''ugly'', which satisfy identified selection criteria. Our subtraction procedure uses quotient quivers that are ''bad'', differing thereby from quiver subtractions based o…

Good to know, #AlaskaAirlines!
#AI #chatbot

This https://arxiv.org/abs/2402.14095 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

Zero-shot generalization across architectures for visual classification
Generalization to unseen data is a key desideratum for deep networks, but its relation to classification accuracy is unclear. Using a minimalist vision dataset and a measure of generalizability, we show that popular networks, from deep convolutional networks (CNNs) to transformers, vary in their power to extrapolate to unseen classes both across layers and across architectures. Accuracy is not a good predictor of generalizability, and generalization varies non-monotonically with layer depth.

This https://arxiv.org/abs/2311.08283 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
Group testing (GT) is the Boolean version of spare signal recovery and, due to its simplicity, a marketplace for ideas that can be brought to bear upon related problems, such as heavy hitters, compressed sensing, and multiple access channels. The definition of a "good" GT varies from one buyer to another, but it generally includes (i) usage of nonadaptive tests, (ii) limiting to $O(k \log n)$ tests, (iii) resiliency to test noise, (iv) $O(k \mathrm{poly}(\log n))$ decoding time, and (v) lack of…

This https://arxiv.org/abs/2306.14207 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Sampling discretization of the uniform norm and applications
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is sufficient to use $e^{CN}$ sample points for an accurate upper bound for the uniform norm by the discrete norm and that one cannot improve on the exponential growth of the number of sampling points for a good discretization theorem in the uniform norm. In this pape…

This https://arxiv.org/abs/2310.09372 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Infinitely wildly ramified arboreal representations for postcritically finite polynomials with potential good reduction
Let $K$ be a number field, let $v$ be a finite place of $K$, let $f\in K[z]$ be a degree $d\geqslant2$ polynomial with $v|d$, and let $a\in K$. We show that if $f$ is postcritically bounded and has potential good reduction with respect to $v$, then the arboreal representation associated to the pair $(f,a)$ is either finite or infinitely wildly ramified above $v$.

This https://arxiv.org/abs/2401.12893 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

NICA prospects in searches for light exotics from hidden sectors: the cases of hidden photons and axion-like particles
We present first estimates of NICA sensitivity to Standard Model extensions with light hypothetical particles singlet under the known gauge transformations. Our analysis reveals that NICA can explore new regions in the parameter spaces of models with a hidden vector and models with an axion-like particle of masses about 30-500\,MeV. Some of these regions seem unreachable by other ongoing and approved future projects. NICA has good prospects in discovery ($5σ$) of the new physics after 1 year o…

Adaptive coordination promotes collective cooperation in repeated social dilemmas
Feipeng Zhang, Te Wu, Long Wang
https://arxiv.org/abs/2403.03497 https://…

Adaptive coordination promotes collective cooperation in repeated social dilemmas
Direct reciprocity based on the repeated prisoner's dilemma has been intensively studied. Most theoretical investigations have concentrated on memory-$1$ strategies, a class of elementary strategies just reacting to the previous-round outcomes. Though the properties of "All-or-None" strategies ($AoN_K$) have been discovered, simulations just confirmed the good performance of $AoN_K$ of very short memory lengths. It remains unclear how $AoN_K$ strategies would fare when players have access to lo…

Fast and simple inner-loop algorithms of static / dynamic BLP estimations
Takeshi Fukasawa
https://arxiv.org/abs/2404.04494 https://arxiv.org/pdf/2404.04494
arXiv:2404.04494v1 Announce Type: new
Abstract: This study investigates computationally efficient inner-loop algorithms for estimating static / dynamic BLP models. It provides the following ideas to reduce the number of inner-loop iterations: (1). Add a term concerning the outside option share in the BLP contraction mapping; (2). Analytically represent mean product utilities as a function of value functions and solve for the value functions (for dynamic BLP); (3-1). Combine the spectral / SQUAREM algorithms; (3-2). Choice of the step sizes. These methods are independent and easy to implement. This study shows good performance of these ideas by numerical experiments.

Temperature and Solvent Viscosity Tune the Intermediates During the Collapse of a Polymer
Suman Majumder, Henrik Christiansen, Wolfhard Janke
https://arxiv.org/abs/2405.04813

Temperature and Solvent Viscosity Tune the Intermediates During the Collapse of a Polymer
Dynamics of a polymer chain in solution gets significantly affected by the temperature and the frictional forces arising due to solvent viscosity. Here, using an explicit solvent framework for polymer simulation with the liberty to tune the solvent viscosity, we study the nonequilibrium dynamics of a flexible homopolymer when it is suddenly quenched from an extended coil state in good solvent to poor solvent conditions. Results from our extensive simulations reveal that depending on the tempera…

This https://arxiv.org/abs/2403.07474 has been replaced.
initial toot: https://mastoxiv.page/@ar…

Optical chaos synchronisation in a cascaded injection experiment
We experimentally study the synchronization of chaos generated by semiconductor lasers in a cascade injection configuration, i.e., a tunable master laser is used to generate chaos by optical injection in a transmitter laser that injects light into a receiver laser. Chaos synchronization between the transmitter and the receiver lasers is achieved with a correlation coefficient of 90 % for a measurement bandwidth up to 35 GHz. Two parameter regions of good synchronization are found, corresponding…

This https://arxiv.org/abs/2308.06240 has been replaced.
initial toot: https://mastoxiv.page/@a…

Superconducting nitridized-aluminum thin films
We report the direct observation of superconductivity in nitridized-aluminum thin films. The films are produced by sputtering deposition of aluminum in a controlled mixture of nitrogen diluted in argon. The concentration of applied nitrogen directly determines the properties of the superconducting thin films. We observe samples displaying critical temperatures up to 3.38$\pm$0.01K and resilience to in-plane magnetic fields well above 1T, with good reproducibility of the results. This work repre…

From quantum difference equation to Dubrovin connection of affine type A quiver varieties
Tianqing Zhu
https://arxiv.org/abs/2405.02473 https://

From quantum difference equation to Dubrovin connection of affine type A quiver varieties
This is the continuation of the article \cite{Z23}. In this article we will give a detailed analysis of the quantum difference equation of the equivariant $K$-theory of the affine type $A$ quiver varieties. We will give a good representation of the quantum difference operator $\mathbf{M}_{\mathcal{L}}(z)$ such that the monodromy operator $\mathbf{B}_{\mathbf{m}}(z)$in the formula can be written in the $U_{q}(\mathfrak{sl}_2)$-form or in the $U_{q}(\hat{\mathfrak{gl}}_1)$-form. We also give the …

Kukei.eu bots that spamming the website with bullshit queries are so prominent now that my power consumption raised more than 100% (33W).
But I think I managed to get rid of them by a smart CF WAF rule: interactive challenge for all traffic that uses http 1.x.
It seems those bots use this for now and I doubt they will adjust it to http 2 like normal users.
So far so good. Bot traffic incoming is zero for now.

IMELL Cut Elimination with Linear Overhead
Beniamino Accattoli, Claudio Sacerdoti Coen
https://arxiv.org/abs/2405.03669 https://arxiv…

IMELL Cut Elimination with Linear Overhead
Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with rewriting rules at-a-distance for cut elimination. He also introduced a new cut elimination strategy, dubbed the good strategy, and showed that its number of steps is a time cost model with polynomial overhead for the ESC/IMELL, and the first such one. Here, we refine Accattoli's result by introducing an abstra…

This https://arxiv.org/abs/1905.07342 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pair-Matching: Links Prediction with Adaptive Queries
The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, represent the good matches. The algorithm queries pairs of nodes and observes the presence/absence of edges. Its goal is to discover as many edges as possible with a fixed budget of queries. Pair-matching is a particular instance of multi-armed bandit…

This https://arxiv.org/abs/2404.03580 has been replaced.
initial toot: https://mastoxiv.page/@ar…

The CCube reconstruction algorithm for the SoLid experiment
The SoLid experiment is a very-short-baseline experiment aimed at searching for nuclear reactor-produced active to sterile antineutrino oscillations. The detection principle is based on the pairing of two types of solid scintillators: polyvinyl toluene and $^6$LiF:ZnS(Ag), which is a new technology used in this field of Physics. In addition to good neutron-gamma discrimination, this setup allows the detector to be highly segmented (the basic detection unit is a 5~cm side cube). High segmentatio…

This https://arxiv.org/abs/2307.15184 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Sparsity aware coding for single photon sensitive vision using Selective Sensing
Optical coding is widely used in computational imaging systems and is a good approach for designing vision systems. However, most coding methods are developed assuming additive Gaussian noise, while modern optical imaging systems are mainly affected by Poisson noise. Previous studies have highlighted the significant differences between these noise models and proposed coding optimization algorithms for image recovery under Poisson noise. They concluded that the compressibility arising from data …

{\sc SimBIG}: Cosmological Constraints using Simulation-Based Inference of Galaxy Clustering with Marked Power Spectra
Elena Massara, ChangHoon Hahn, Michael Eickenberg, Shirley Ho, Jiamin Hou, Pablo Lemos, Chirag Modi, Azadeh Moradinezhad Dizgah, Liam Parker, Bruno R\'egaldo-Saint Blancard
https://arxiv.org/abs/2404.04228…

{\sc SimBIG}: Cosmological Constraints using Simulation-Based Inference of Galaxy Clustering with Marked Power Spectra
We present the first $Λ$CDM cosmological analysis performed on a galaxy survey using marked power spectra. The marked power spectrum is the two-point function of a marked field, where galaxies are weighted by a function that depends on their local density. The presence of the mark leads these statistics to contain higher-order information of the original galaxy field, making them a good candidate to exploit the non-Gaussian information of a galaxy catalog. In this work we make use of \simbig, …

This https://arxiv.org/abs/2403.16760 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csHC_…

As Good As A Coin Toss Human detection of AI-generated images, videos, audio, and audiovisual stimuli
As synthetic media becomes progressively more realistic and barriers to using it continue to lower, the technology has been increasingly utilized for malicious purposes, from financial fraud to nonconsensual pornography. Today, the principal defense against being misled by synthetic media relies on the ability of the human observer to visually and auditorily discern between real and fake. However, it remains unclear just how vulnerable people actually are to deceptive synthetic media in the cou…

QCD Predictions for Meson Electromagnetic Form Factors at High Momenta: Testing Factorization in Exclusive Processes
Heng-Tong Ding, Xiang Gao, Andrew D. Hanlon, Swagato Mukherjee, Peter Petreczky, Qi Shi, Sergey Syritsyn, Rui Zhang, Yong Zhao
https://arxiv.org/abs/2404.04412

QCD Predictions for Meson Electromagnetic Form Factors at High Momenta: Testing Factorization in Exclusive Processes
We report the first lattice QCD computation of pion and kaon electromagnetic form factors, $F_M(Q^2)$, at large momentum transfer up to 10 and 28 $\mathrm{GeV}^2$, respectively. Utilizing physical masses and two fine lattices, we achieve good agreement with JLab experimental results at $Q^2 \lesssim 4~\mathrm{GeV}^2$. For $Q^2 \gtrsim 4~\mathrm{GeV}^2$, our results provide $\textit{ab-initio}$ QCD benchmarks for the forthcoming experiments at JLab 12 GeV and future electron-ion colliders. We al…

Laminar planar jets of elastoviscoplastic fluids
Giovanni Soligo, Marco Edoardo Rosti
https://arxiv.org/abs/2404.03890 https://arxiv.…

Laminar planar jets of elastoviscoplastic fluids
We perform numerical simulations of planar jets of elastoviscoplastic (EVP) fluid (\citet{saramito2007new} model) at low Reynolds number. Three different configurations are considered: $(i)$ EVP jet in EVP ambient fluid, $(ii)$ EVP jet in Newtonian ambient fluid (miscible), and $(iii)$ EVP jet in Newtonian ambient fluid (immiscible). We investigate the effect of the Bingham number, \textit{i.e.} of the dimensionless yield stress of the EVP fluid, on the jet dynamics, and find a good agreement w…

On products of K-moduli spaces
Thedoros S. Papazachariou
https://arxiv.org/abs/2403.04544 https://arxiv.org/pdf/2403.04544

On products of K-moduli spaces
We study the K-moduli space of products of Fano varieties in relation to the product of K-moduli spaces of the product components. We show that there exists a well-defined morphism from the product of K-moduli stacks of Fano varieties to the K-moduli stack of their product. We further show that this morphism is an isomorphism if the two varieties are non-isomorphic, and a torsor if they are. Our results rely on the theory of stacks, and we extend them to general Artin stacks admitting good modu…

This https://arxiv.org/abs/2004.13938 has been replaced.
link: https://scholar.google.com/scholar?q=a

Families of sequences with good family complexity and cross-correlation measure
In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also on $k$-symbols ($k$-ary) alphabet. We first generalize some known methods on construction of the family of binary pseudorandom sequences. We prove a bound on the $f$-complexity of a large family of binary sequences of Legendre-symbols of certain irreducible p…

@… just curious, why does your Fediverse news bot only boost those that oppose Threads? You seem to post good and straight forward facts, yet your bot seems to only boost those with opposing opinions and statements that are sometimes false...😬

A3COSMOS & A3GOODSS: Continuum Source Catalogues and Multi-band Number Counts
Sylvia Adscheid, Benjamin Magnelli, Daizhong Liu, Frank Bertoldi, Ivan Delvecchio, Carlotta Gruppioni, Eva Schinnerer, Alberto Traina, Matthieu B\'ethermin, Athanasia Gkogkou
https://arxiv.org/abs/2403.03125 https://arxiv.org/pdf/2403.03125
arXiv:2403.03125v1 Announce Type: new
Abstract: Galaxy submillimetre number counts are a fundamental measurement in our understanding of galaxy evolution models. Most early measurements are obtained via single-dish telescopes with substantial source confusion, whereas recent interferometric observations are limited to small areas. We used a large database of ALMA continuum observations to accurately measure galaxy number counts in multiple (sub)millimetre bands, thus bridging the flux density range between single-dish surveys and deep interferometric studies. We continued the Automated Mining of the ALMA Archive in the COSMOS Field project (A3COSMOS) and extended it with observations from the GOODS-South field (A3GOODSS). The database consists of ~4,000 pipeline-processed continuum images from the public ALMA archive, yielding 2,050 unique detected sources. To infer galaxy number counts, we constructed a method to reduce the observational bias inherent to targeted pointings that dominate the database. This method comprises a combination of image selection, masking, and source weighting. The effective area was calculated by accounting for inhomogeneous wavelengths, sensitivities, and resolutions and for spatial overlap between images. We tested and calibrated our method with simulations. We obtained the first number counts derived in a consistent and homogeneous way in four different ALMA bands covering a relatively large area. The results are consistent with number counts from the literature within the uncertainties. We extended the available depth in ALMA Band 4 by 0.4 dex with respect to previous studies. In Band 7, at the depth of the inferred number counts, ~40% of the cosmic infrared background is resolved into discrete sources. This fraction, however, decreases with wavelength, reaching ~4% in Band 3. Finally, we used the number counts to test models of dusty galaxy evolution, and find a good agreement within the uncertainties.

In-Flight Estimation of Instrument Spectral Response Functions Using Sparse Representations
Jihanne El Haouari, Jean-Michel Gaucel, Christelle Pittet, Jean-Yves Tourneret, Herwig Wendt
https://arxiv.org/abs/2404.05298

In-Flight Estimation of Instrument Spectral Response Functions Using Sparse Representations
Accurate estimates of Instrument Spectral Response Functions (ISRFs) are crucial in order to have a good characterization of high resolution spectrometers. Spectrometers are composed of different optical elements that can induce errors in the measurements and therefore need to be modeled as accurately as possible. Parametric models are currently used to estimate these response functions. However, these models cannot always take into account the diversity of ISRF shapes that are encountered in p…

Quantum mechanical aspects of coherent photoproduction: the limits of coherence, and multiple vector mesons
Spencer R. Klein
https://arxiv.org/abs/2404.04450

Quantum mechanical aspects of coherent photoproduction: the limits of coherence, and multiple vector mesons
Quantum mechanics is central to coherent photoproduction in ultra-peripheral collisions (UPCs). This writeup will discuss some surprising aspects of UPCs that stem from these quantum mechanical roots. The Good-Walker (GW) paradigm, which connects coherent photoproduction with the target nucleus remaining in its ground state. This contrasts with a semi-classical picture, where coherence depends on the positions of the individual nucleons and the momentum transfer. Unlike the GW approach, the sem…

Quantum for Good and the Societal Impact of Quantum Computing
Matthias Troyer, Emily Violi Benjamin, Ani Gevorkian
https://arxiv.org/abs/2403.02921 https:/…

Quantum for Good and the Societal Impact of Quantum Computing
Quantum computing promises to help humanity solve problems that would otherwise be intractable on classical computers. Unlike today's machines, quantum computers use a novel computing process that leverages the foundational quantum mechanical laws of nature. This unlocks unparalleled compute power for certain applications and promises to help solve some of our generation's gravest challenges, including the climate crisis, food insecurity, and widespread disease. No one entity will be able to re…

This https://arxiv.org/abs/2306.10482 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Weighted structure tensor total variation for image denoising
For image denoising problems, the structure tensor total variation (STV)-based models show good performances when compared with other competing regularization approaches. However, the STV regularizer does not couple the local information of the image and may not maintain the image details. Therefore, we employ the anisotropic weighted matrix introduced in the anisotropic total variation (ATV) model to improve the STV model. By applying the weighted matrix to the discrete gradient of the patch-b…

Adaptive coordination promotes collective cooperation in repeated social dilemmas
Feipeng Zhang, Te Wu, Long Wang
https://arxiv.org/abs/2403.03497 https://…

Adaptive coordination promotes collective cooperation in repeated social dilemmas
Direct reciprocity based on the repeated prisoner's dilemma has been intensively studied. Most theoretical investigations have concentrated on memory-$1$ strategies, a class of elementary strategies just reacting to the previous-round outcomes. Though the properties of "All-or-None" strategies ($AoN_K$) have been discovered, simulations just confirmed the good performance of $AoN_K$ of very short memory lengths. It remains unclear how $AoN_K$ strategies would fare when players have access to lo…

Doubly Abductive Counterfactual Inference for Text-based Image Editing
Xue Song, Jiequan Cui, Hanwang Zhang, Jingjing Chen, Richang Hong, Yu-Gang Jiang
https://arxiv.org/abs/2403.02981

Doubly Abductive Counterfactual Inference for Text-based Image Editing
We study text-based image editing (TBIE) of a single image by counterfactual inference because it is an elegant formulation to precisely address the requirement: the edited image should retain the fidelity of the original one. Through the lens of the formulation, we find that the crux of TBIE is that existing techniques hardly achieve a good trade-off between editability and fidelity, mainly due to the overfitting of the single-image fine-tuning. To this end, we propose a Doubly Abductive Count…

Preventing Reward Hacking with Occupancy Measure Regularization
Cassidy Laidlaw, Shivam Singhal, Anca Dragan
https://arxiv.org/abs/2403.03185 https://

Preventing Reward Hacking with Occupancy Measure Regularization
Reward hacking occurs when an agent performs very well with respect to a "proxy" reward function (which may be hand-specified or learned), but poorly with respect to the unknown true reward. Since ensuring good alignment between the proxy and true reward is extremely difficult, one approach to prevent reward hacking is optimizing the proxy conservatively. Prior work has particularly focused on enforcing the learned policy to behave similarly to a "safe" policy by penalizing the KL divergence be…

The Emerging Stellar Complex in Mon R2: Membership and Optical Variability Classification
Sally D. Jiang, Lynne A. Hillenbrand
https://arxiv.org/abs/2403.03843

The Emerging Stellar Complex in Mon R2: Membership and Optical Variability Classification
Monoceros R2 (Mon R2) is one of the closest large active star-forming regions. This extremely young and partially embedded region provides an excellent laboratory for studying star formation and the early evolution of young stellar objects (YSOs). In this paper, we conduct an optical study of the greater Mon R2 region. Beginning with 1690 previously identified candidate YSOs, we used 496 sources with good proper motions and parallaxes from Gaia DR3 to determine the astrometric properties for li…

This https://arxiv.org/abs/2308.02499 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Complex spherical designs from group orbits
We consider the general question of when all orbits under the unitary action of a finite group give a complex spherical design. Those orbits which have large stabilisers are then good candidates for being optimal complex spherical designs. This is done by developing the general theory of complex designs and associated (harmonic) Molien series for group actions. As an application, we give explicit constructions of some putatively optimal real and complex spherical t-designs.

cuPSS: a package for pseudo-spectral integration of stochastic PDEs
Fernando Caballero
https://arxiv.org/abs/2405.02410 https://arxiv…

cuPSS: a package for pseudo-spectral integration of stochastic PDEs
A large part of modern research, especially in the broad field of complex systems, relies on the numerical integration of PDEs, with and without stochastic noise. This is usually done with eiher in- house made codes or external packages like MATLAB, Mathematica, Fenicsx, OpenFOAM, Dedalus, and others. These packages rarely offer a good combination of speed, generality, and the option to easily add stochasticity to the system, while in-house codes depend on certain expertise to obtain good perfo…

This https://arxiv.org/abs/1905.07342 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pair-Matching: Links Prediction with Adaptive Queries
The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, represent the good matches. The algorithm queries pairs of nodes and observes the presence/absence of edges. Its goal is to discover as many edges as possible with a fixed budget of queries. Pair-matching is a particular instance of multi-armed bandit…

On the $p$-adic values of the weight two Eisenstein series for supersingular primes
Pavel Guerzhoy
https://arxiv.org/abs/2403.02592 https://

On the $p$-adic values of the weight two Eisenstein series for supersingular primes
The weight two Eisenstein series may be considered as the first example of a Katz $p$-adic modular form. Classically, its values are defined for the primes of ordinary reduction. We offer a modified definition which applies uniformly to all primes of good reduction, both ordinary and supersingular. We show that, in the case of complex multiplication, these $p$-adic values coincide with the algebraic value of this Eisenstein series.

This https://arxiv.org/abs/2302.00360 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Faster maximal clique enumeration in large real-world link streams
Link streams offer a good model for representing interactions over time. They consist of links $(b,e,u,v)$, where $u$ and $v$ are vertices interacting during the whole time interval $[b,e]$. In this paper, we deal with the problem of enumerating maximal cliques in link streams. A clique is a pair $(C,[t_0,t_1])$, where $C$ is a set of vertices that all interact pairwise during the full interval $[t_0,t_1]$. It is maximal when neither its set of vertices nor its time interval can be increased. S…

Review of Nanolayered Post-transition Metal Monochalcogenides: Synthesis, Properties, and Applications
Mingyu Yu, Maria Hilse, Qihua Zhang, Yongchen Liu, Zhengtianye Wang, Stephanie Law
https://arxiv.org/abs/2403.02956

Review of Nanolayered Post-transition Metal Monochalcogenides: Synthesis, Properties, and Applications
Nanolayered post-transition metal monochalcogenides (PTMMCs) stand out as promising advanced two-dimensional (2D) materials. Beyond inheriting the general advantages associated with traditional 2D materials, they exhibit unique properties, including a wide bandgap range covering the ultraviolet to the mid-infrared spectral ranges, thickness-dependent bandgap behaviors, good nonlinear optical performance, high thermoelectric coefficients, and ferroelectricity. Consequently, these materials hold …

This https://arxiv.org/abs/2304.11698 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Hydrodynamic limits for kinetic equations preserving mass, momentum and energy: a spectral and unified approach in the presence of a spectral gap
Triggered by the fact that, in the hydrodynamic limit, several different kinetic equations of physical interest all lead to the same Navier-Stokes-Fourier system, we develop in the paper an abstract framework which allows to explain this phenomenon. The method we develop can be seen as a significant improvement of known approaches for which we fully exploit some structural assumptions on the linear and nonlinear collision operators as well as a good knowledge of the Cauchy theory for the limiti…

A method for quantifying the generalization capabilities of generative models for solving Ising models
Qunlong Ma, Zhi Ma, Ming Gao
https://arxiv.org/abs/2405.03435

A method for quantifying the generalization capabilities of generative models for solving Ising models
For Ising models with complex energy landscapes, whether the ground state can be found by neural networks depends heavily on the Hamming distance between the training datasets and the ground state. Despite the fact that various recently proposed generative models have shown good performance in solving Ising models, there is no adequate discussion on how to quantify their generalization capabilities. Here we design a Hamming distance regularizer in the framework of a class of generative models, …

This https://arxiv.org/abs/2403.16760 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csHC_…

As Good As A Coin Toss Human detection of AI-generated images, videos, audio, and audiovisual stimuli
As synthetic media becomes progressively more realistic and barriers to using it continue to lower, the technology has been increasingly utilized for malicious purposes, from financial fraud to nonconsensual pornography. Today, the principal defense against being misled by synthetic media relies on the ability of the human observer to visually and auditorily discern between real and fake. However, it remains unclear just how vulnerable people actually are to deceptive synthetic media in the cou…

This https://arxiv.org/abs/2404.08132 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Goppa Codes: Key to High Efficiency and Reliability in Communications
In this paper, we study some codes of algebraic geometry related to certain maximal curves. Quantum stabilizer codes obtained through the self orthogonality of Hermitian codes of this error correcting do not always have good parameters. However, appropriate parameters found that the Hermitian self-orthogonal code quantum stabilizer code has good parameters. Therefore, we investigated the quantum stabilizer code at a certain maximum curve and modified its parameters. Algebraic geometry codes sho…

This https://arxiv.org/abs/1611.06876 has been replaced.
link: https://scholar.google.com/scholar?q=a

Validity of Chemical Equilibrium Approach in the Study of Kinetic Freeze-out in p-Pb Collisions at LHC
Transverse momentum spectra of identified pions, Kaons , protons and Lambdas produced at mid-rapidity (0 < ycm < 0.5) in p-Pb collisions at root(sNN) = 5.02 TeV is studied for different collision centralities by using a Unified Statistical Thermal Freeze-out Model (USTFM). A fairly good agreement is seen between the calculated results and the experimental data points taken from the ALICE experiment. Kinetic freeze-out conditions are extracted from the fits of the transverse momentum spectra of …

Dirichlet-based Per-Sample Weighting by Transition Matrix for Noisy Label Learning
HeeSun Bae, Seungjae Shin, Byeonghu Na, Il-Chul Moon
https://arxiv.org/abs/2403.02690

Dirichlet-based Per-Sample Weighting by Transition Matrix for Noisy Label Learning
For learning with noisy labels, the transition matrix, which explicitly models the relation between noisy label distribution and clean label distribution, has been utilized to achieve the statistical consistency of either the classifier or the risk. Previous researches have focused more on how to estimate this transition matrix well, rather than how to utilize it. We propose good utilization of the transition matrix is crucial and suggest a new utilization method based on resampling, coined REN…

EPOCHS IV: SED Modelling Assumptions and their impact on the Stellar Mass Function at 6.5 < z < 13.5 using PEARLS and public JWST observations
Thomas Harvey, Christopher Conselice, Nathan J. Adams, Duncan Austin, Ignas Juodzbalis, James Trussler, Qiong Li, Katherine Ormerod, Leonardo Ferreira, Qiao Duan, Lewi Westcott, Honor Harris, Rachana Bhatawdekar, Dan Coe, Seth H. Cohen, Joseph Caruana, Cheng Cheng, 9 Simon P. Driver, Brenda Frye, Lukas J. Furtak, Norman A. Grogin, Nimish P…

EPOCHS IV: SED Modelling Assumptions and their impact on the Stellar Mass Function at 6.5 < z < 13.5 using PEARLS and public JWST observations
We utilize deep JWST NIRCam observations for the first direct constraints on the Galaxy Stellar Mass Function (GSMF) at z>10. Our EPOCHS v1 sample includes 1120 galaxy candidates at 6.5

This https://arxiv.org/abs/2311.07978 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

How good are Large Language Models on African Languages?
Recent advancements in natural language processing have led to the proliferation of large language models (LLMs). These models have been shown to yield good performance, using in-context learning, even on tasks and languages they are not trained on. However, their performance on African languages is largely understudied relative to high-resource languages. We present an analysis of four popular large language models (mT0, Aya, LLaMa 2, and GPT-4) on six tasks (topic classification, sentiment cl…

UniDoorManip: Learning Universal Door Manipulation Policy Over Large-scale and Diverse Door Manipulation Environments
Yu Li, Xiaojie Zhang, Ruihai Wu, Zilong Zhang, Yiran Geng, Hao Dong, Zhaofeng He
https://arxiv.org/abs/2403.02604

UniDoorManip: Learning Universal Door Manipulation Policy Over Large-scale and Diverse Door Manipulation Environments
Learning a universal manipulation policy encompassing doors with diverse categories, geometries and mechanisms, is crucial for future embodied agents to effectively work in complex and broad real-world scenarios. Due to the limited datasets and unrealistic simulation environments, previous works fail to achieve good performance across various doors. In this work, we build a novel door manipulation environment reflecting different realistic door manipulation mechanisms, and further equip this en…

How open is the asteroid-mass primordial black hole window?
Matthew Gorton, Anne M. Green
https://arxiv.org/abs/2403.03839 https://ar…

How open is the asteroid-mass primordial black hole window?
Primordial black holes (PBHs) can make up all of the dark matter (DM) if their mass, $m$, is in the so-called 'asteroid-mass window', $10^{17} \, {\rm g} \lesssim m \lesssim 10^{22} \, {\rm g}$. Observational constraints on the abundance of PBHs are usually calculated assuming they all have the same mass, however this is unlikely to be a good approximation. PBHs formed from the collapse of large density perturbations during radiation domination are expected to have an extended mass function (MF…

Understanding LLMs Requires More Than Statistical Generalization
Patrik Reizinger, Szilvia Ujv\'ary, Anna M\'esz\'aros, Anna Kerekes, Wieland Brendel, Ferenc Husz\'ar
https://arxiv.org/abs/2405.01964

Understanding LLMs Requires More Than Statistical Generalization
The last decade has seen blossoming research in deep learning theory attempting to answer, "Why does deep learning generalize?" A powerful shift in perspective precipitated this progress: the study of overparametrized models in the interpolation regime. In this paper, we argue that another perspective shift is due, since some of the desirable qualities of LLMs are not a consequence of good statistical generalization and require a separate theoretical explanation. Our core argument relies on the…

This https://arxiv.org/abs/2303.08763 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

A Convergent Numerical Algorithm for $α$-Dissipative Solutions of the Hunter--Saxton Equation
A convergent numerical method for $α$-dissipative solutions of the Hunter--Saxton equation is derived. The method is based on applying a tailor-made projection operator to the initial data, and then solving exactly using the generalized method of characteristics. The projection step is the only step that introduces any approximation error. It is therefore crucial that its design ensures not only a good approximation of the initial data, but also that errors due to the energy dissipation at lat…

Enhancing Trust in LLM-Generated Code Summaries with Calibrated Confidence Scores
Yuvraj Virk, Premkumar Devanbu, Toufique Ahmed
https://arxiv.org/abs/2404.19318

Enhancing Trust in LLM-Generated Code Summaries with Calibrated Confidence Scores
A good summary can often be very useful during program comprehension. While a brief, fluent, and relevant summary can be helpful, it does require significant human effort to produce. Often, good summaries are unavailable in software projects, thus making maintenance more difficult. There has been a considerable body of research into automated AI-based methods, using Large Language models (LLMs), to generate summaries of code; there also has been quite a bit work on ways to measure the performan…

Cohort-Individual Cooperative Learning for Multimodal Cancer Survival Analysis
Huajun Zhou, Fengtao Zhou, Hao Chen
https://arxiv.org/abs/2404.02394 https:/…

Cohort-Individual Cooperative Learning for Multimodal Cancer Survival Analysis
Recently, we have witnessed impressive achievements in cancer survival analysis by integrating multimodal data, e.g., pathology images and genomic profiles. However, the heterogeneity and high dimensionality of these modalities pose significant challenges for extracting discriminative representations while maintaining good generalization. In this paper, we propose a Cohort-individual Cooperative Learning (CCL) framework to advance cancer survival analysis by collaborating knowledge decompositio…

A mean-field model of optimal investment
Alessandro Calvia, Salvatore Federico, Giorgio Ferrari, Fausto Gozzi
https://arxiv.org/abs/2404.02871 https://

A mean-field model of optimal investment
We establish the existence and uniqueness of the equilibrium for a stochastic mean-field game of optimal investment. The analysis covers both finite and infinite time horizons, and the mean-field interaction of the representative company with a mass of identical and indistinguishable firms is modeled through the time-dependent price at which the produced good is sold. At equilibrium, this price is given in terms of a nonlinear function of the expected (optimally controlled) production capacity …

This https://arxiv.org/abs/2301.13447 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Benchmarking Model Predictive Control Algorithms in Building Optimization Testing Framework (BOPTEST)
We present a data-driven modeling and control framework for physics-based building emulators. Our approach consists of: (a) Offline training of differentiable surrogate models that accelerate model evaluations, provide cost-effective gradients, and maintain good predictive accuracy for the receding horizon in Model Predictive Control (MPC), and (b) Formulating and solving nonlinear building HVAC MPC problems. We extensively evaluate the modeling and control performance using multiple surrogate …

This https://arxiv.org/abs/2111.06983 has been replaced.
link: https://scholar.google.com/scholar?q=a

Positroids are 3-colorable
We show that every positroid of rank $r \geq 3$ has a good coline. Using the definition of the chromatic number of oriented matroid introduced by J.\ Nešetřil, R.\ Nickel, and W.~Hochstättler, this shows that every orientation of a positroid is 3-colorable.

This https://arxiv.org/abs/2303.08763 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

A Convergent Numerical Algorithm for $α$-Dissipative Solutions of the Hunter--Saxton Equation
A convergent numerical method for $α$-dissipative solutions of the Hunter--Saxton equation is derived. The method is based on applying a tailor-made projection operator to the initial data, and then solving exactly using the generalized method of characteristics. The projection step is the only step that introduces any approximation error. It is therefore crucial that its design ensures not only a good approximation of the initial data, but also that errors due to the energy dissipation at lat…

Context-Aware Clustering using Large Language Models
Sindhu Tipirneni, Ravinarayana Adkathimar, Nurendra Choudhary, Gaurush Hiranandani, Rana Ali Amjad, Vassilis N. Ioannidis, Changhe Yuan, Chandan K. Reddy
https://arxiv.org/abs/2405.00988

Context-Aware Clustering using Large Language Models
Despite the remarkable success of Large Language Models (LLMs) in text understanding and generation, their potential for text clustering tasks remains underexplored. We observed that powerful closed-source LLMs provide good quality clusterings of entity sets but are not scalable due to the massive compute power required and the associated costs. Thus, we propose CACTUS (Context-Aware ClusTering with aUgmented triplet losS), a systematic approach that leverages open-source LLMs for efficient and…

This https://arxiv.org/abs/2301.02075 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Beyond Inverted Pendulums: Task-optimal Simple Models of Legged Locomotion
Reduced-order models (ROM) are popular in online motion planning due to their simplicity. A good ROM for control captures critical task-relevant aspects of the full dynamics while remaining low dimensional. However, planning within the reduced-order space unavoidably constrains the full model, and hence we sacrifice the full potential of the robot. In the community of legged locomotion, this has lead to a search for better model extensions, but many of these extensions require human intuition, …

This https://arxiv.org/abs/2403.19598 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Implications of purity constraints on light higgsinos
The lightest supersymmetric particles could be higgsinos that have a small mixing with gauginos. If the lightest higgsino-like state makes up some or all of the dark matter with a thermal freezeout density, then its mass must be between about 100 and 1150 GeV, and dark matter searches put bounds on the amount of gaugino contamination that it can have. Motivated by the generally good agreement of flavor- and CP-violating observables with Standard Model predictions, I consider models in which the…

Special matrices over finite fields and their applications to quantum error-correcting codes
Meng Cao
https://arxiv.org/abs/2405.02285 https://

Special matrices over finite fields and their applications to quantum error-correcting codes
The matrix-product (MP) code $\mathcal{C}_{A,k}:=[\mathcal{C}_{1},\mathcal{C}_{2},\ldots,\mathcal{C}_{k}]\cdot A$ with a non-singular by column (NSC) matrix $A$ plays an important role in constructing good quantum error-correcting codes. In this paper, we study the MP code when the defining matrix $A$ satisfies the condition that $AA^†$ is $(D,τ)$-monomial. We give an explicit formula for calculating the dimension of the Hermitian hull of a MP code. We provide the necessary and sufficient co…

This https://arxiv.org/abs/2306.02290 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Simultaneous supersingular reductions of Hecke orbits
Fix a finite set of primes $\mathcal{S}$, for an abelian variety $A_0$ over $\overline{\mathbb{Q}}$ (with extra structures) which has supersingular good reductions at all $\ell\in\mathcal{S}$, we consider the simultaneous reduction modulo $\ell\in\mathcal{S}$ of several copies of $p$-adic/prime-to-$N$ Hecke orbits of $A_0$. We show that this simultaneous reduction map is always surjective under certain rationality condition on the copies of the Hecke orbits.

Prototype-based Interpretable Breast Cancer Prediction Models: Analysis and Challenges
Shreyasi Pathak, J\"org Schl\"otterer, Jeroen Veltman, Jeroen Geerdink, Maurice van Keulen, Christin Seifert
https://arxiv.org/abs/2403.20260

Prototype-based Interpretable Breast Cancer Prediction Models: Analysis and Challenges
Deep learning models have achieved high performance in medical applications, however, their adoption in clinical practice is hindered due to their black-box nature. Self-explainable models, like prototype-based models, can be especially beneficial as they are interpretable by design. However, if the learnt prototypes are of low quality then the prototype-based models are as good as black-box. Having high quality prototypes is a pre-requisite for a truly interpretable model. In this work, we pro…

This https://arxiv.org/abs/2403.19154 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

STaR-GATE: Teaching Language Models to Ask Clarifying Questions
When prompting language models to complete a task, users often leave important aspects unsaid. While asking questions could resolve this ambiguity \citep[GATE;][]{li2023eliciting}, models often struggle to ask good questions. We explore a language model's ability to self-improve \citep[STaR;][]{zelikman2022star} by rewarding the model for generating useful questions -- a simple method we dub STaR-GATE. We generate a synthetic dataset of 25,500 unique persona-task prompts to simulate conversatio…

Leveraging Swarm Intelligence to Drive Autonomously: A Particle Swarm Optimization based Approach to Motion Planning
Sven Ochs, Jens Doll, Marc Heinrich, Philip Sch\"orner, Sebastian Klemm, Marc Ren\'e Zofka, J. Marius Z\"ollner
https://arxiv.org/abs/2404.02644

Leveraging Swarm Intelligence to Drive Autonomously: A Particle Swarm Optimization based Approach to Motion Planning
Motion planning is an essential part of autonomous mobile platforms. A good pipeline should be modular enough to handle different vehicles, environments, and perception modules. The planning process has to cope with all the different modalities and has to have a modular and flexible design. But most importantly, it has to be safe and robust. In this paper, we want to present our motion planning pipeline with particle swarm optimization (PSO) at its core. This solution is independent of the vehi…

This https://arxiv.org/abs/2311.02923 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Workshop summary -- Kaons@CERN 2023
Kaon physics is at a turning point -- while the rare-kaon experiments NA62 and KOTO are in full swing, the end of their lifetime is approaching and the future experimental landscape needs to be defined. With HIKE, KOTO-II and LHCb-Phase-II on the table and under scrutiny, it is a very good moment in time to take stock and contemplate about the opportunities these experiments and theoretical developments provide for particle physics in the coming decade and beyond. This paper provides a compact …

Learning Explicitly Conditioned Sparsifying Transforms
Andrei P\u{a}tra\c{s}cu, Cristian Rusu, Paul Irofti
https://arxiv.org/abs/2403.03168 https://…

Learning Explicitly Conditioned Sparsifying Transforms
Sparsifying transforms became in the last decades widely known tools for finding structured sparse representations of signals in certain transform domains. Despite the popularity of classical transforms such as DCT and Wavelet, learning optimal transforms that guarantee good representations of data into the sparse domain has been recently analyzed in a series of papers. Typically, the conditioning number and representation ability are complementary key features of learning square transforms tha…

Joint torques prediction of a robotic arm using neural networks
Giulia d'Addato, Ruggero Carli, Eurico Pedrosa, Artur Pereira, Luigi Palopoli, Daniele Fontanelli
https://arxiv.org/abs/2405.00695

Joint torques prediction of a robotic arm using neural networks
Accurate dynamic models are crucial for many robotic applications. Traditional approaches to deriving these models are based on the application of Lagrangian or Newtonian mechanics. Although these methods provide a good insight into the physical behaviour of the system, they rely on the exact knowledge of parameters such as inertia, friction and joint flexibility. In addition, the system is often affected by uncertain and nonlinear effects, such as saturation and dead zones, which can be diffic…

A randomized lattice rule without component-by-component construction
Takashi Goda
https://arxiv.org/abs/2403.02660 https://arxiv.org…

A randomized lattice rule without component-by-component construction
We study the multivariate integration problem for periodic functions from the weighted Korobov space in the randomized setting. We introduce a new randomized rank-1 lattice rule with a randomly chosen number of points, which avoids the need for component-by-component construction in the search for good generating vectors while still achieving nearly the optimal rate of the randomized error. Our idea is to exploit the fact that at least half of the possible generating vectors yield nearly the op…